Optimal Replica Placement in Data Grid Environments with Locality Assurance

نویسندگان

  • Pangfeng Liu
  • Yi-Fang Lin
  • Jan-Jan Wu
چکیده

Data replication is typically used to improve access performance and data availability in Data Grid systems. To date, research on data replication in Grid systems has focused on infrastructures for replication and mechanisms for creating/deleting replicas. The important problem of choosing suitable locations to place replicas in Data Grids has not been well studied. In this paper, we address three issues concerning data replica placement in Data Grids. The first is how to ensure load balance among replicas. To achieve this, we propose a placement algorithm that finds the optimal locations for replicas so that their workload is balanced. The second issue is how to minimize the number of replicas. To solve this problem, we propose an algorithm that determines the minimum number of replicas required when the maximum workload capacity of each replica server is known. Finally, we address the issue of service quality by proposing a new model in which each request must be given a quality-of-service guarantee. We describe new algorithms that ensure both workload balance and quality of service simultaneously.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Data Replication Strategy in Large-Scale Data Grid Environments Based on Availability and Popularity

The data grid technology, which uses the scale of the Internet to solve storage limitation for the huge amount of data, has become one of the hot research topics. Recently, data replication strategies have been widely employed in distributed environment to copy frequently accessed data in suitable sites. The primary purposes are shortening distance of file transmission and achieving files from ...

متن کامل

Optimal replica placement in hierarchical Data Grids with locality assurance

In this paper, we address three issues concerning data replica placement in hierarchical Data Grids that can be presented as tree structures. The first is how to ensure load balance among replicas. To achieve this, we propose a placement algorithm that finds the optimal locations for replicas so that theirworkload is balanced. The second issue is how to minimize the number of replicas. To solve...

متن کامل

Optimal Replica Placement in Graph Based Data Grids

--------------------------------------------------------------Abstract-----------------------------------------------------------The replica algorithms are built based on the topology of the data grid. The real representation of grid is general graph. So we propose an algorithm called Replica Placement in Graph Topology Grid (RPGTG) to place replicas on graph based data grids. In this paper, we...

متن کامل

A Data Management Framework for Secure and Dependable Data Grid Approved by Supervisory

Data grid enables the sharing and coordinated use of data from various resources and provides various services to fit the needs of high-performance distributed and data-intensive computing. However, access efficiency, availability, and security are among the most important challenges to be addressed. In this research, we use data partitioning schemes (secret sharing and erasure coding combines ...

متن کامل

A new Replica Placement Algorithm in Data Grid

Replica placement is one of the important factors to improve performance in data grid systems. A good replica placement algorithm can result in good performance gains. It should be mentioned that, these algorithms or strategies are dependent on architecture of the data grid. By considering different kinds of architecture in data grid systems, a true representation of a grid is a general graph. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006